#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    string s;
    cin >> s;
    int n = sz(s);
    s = ' ' + s;

    int ans = 0;

    function<void(int, V<int>)> dfs = [&](int u, V<int> p) {
        if (u == n) {
            int tot = 0;
            p.eb(n);
            FOR(i, 1, sz(p) - 1) {
                int l = p[i - 1] + 1, r = p[i];
                int p = 0;
                FOR(j, l, r) {
                    p = p * 10 + (s[j] - '0');
                }
                tot += p;
            }
            p.pop_back();
            ans += tot;
            RE;
        }
        dfs(u + 1, p);
        p.eb(u);
        dfs(u + 1, p);
        p.pop_back();
    };

    dfs(1, V<int>{0});

    cout << ans << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}